home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
InfoMagic Standards 1994 January
/
InfoMagic Standards - January 1994.iso
/
ccitt
/
1988
/
troff
/
6_9_11.tro
< prev
next >
Wrap
Text File
|
1991-12-13
|
97KB
|
4,271 lines
.rs
.\" Troff code generated by TPS Convert from ITU Original Files
.\" Not Copyright ( c) 1991
.\"
.\" Assumes tbl, eqn, MS macros, and lots of luck.
.TA 1c 2c 3c 4c 5c 6c 7c 8c
.ds CH
.ds CF
.EQ
delim @@
.EN
.nr LL 40.5P
.nr ll 40.5P
.nr HM 3P
.nr FM 6P
.nr PO 4P
.nr PD 9p
.po 4P
.rs
\v | 5i'
.sp 1P
.ce 1000
\v'3P'
SECTION\ 4
.ce 0
.sp 1P
.ce 1000
\fBOPERATIONS,\ MAINTENANCE\ AND\ ADMINISTRATION\ PART\ (OMAP)\fR
.ce 0
.sp 1P
.sp 2P
.LP
\fBRecommendation Q.795\fR
.RT
.sp 2P
.sp 1P
.ce 1000
\fBOPERATIONS,\ MAINTENANCE\ AND\ ADMINISTRATION\ PART\ (OMAP)\fR
.EF '% Fascicle\ VI.9\ \(em\ Rec.\ Q.795''
.OF '''Fascicle\ VI.9\ \(em\ Rec.\ Q.795 %'
.ce 0
.sp 1P
.LP
\fB1\fR \fBIntroduction\fR
.sp 1P
.RT
.PP
The purpose of this Recommendation is to provide procedures and
protocols related to operations and maintenance information. These procedures
and protocols are associated with the application layer of the Open Systems
Interconnection model, as well as the System Management Application Process
(SMAP) residing above the application layer. In addition, the procedures and
protocols related to operations and maintenance information use other
procedures and protocols specified by CCITT in the framework of the OSI
model.
.FS
The compatibility of OMAP with OSI management protocols
[i.e.Common Management Information Protocol (CMIP)] is for further
study.
.FE
.PP
The operations and maintenance procedures described are generally
associated with two types of signalling points. The controlled signalling
point(s) are the signalling point(s) to which controls are applied and about
which information is collected. The controlling signalling point(s) are the
signalling point(s) which are initiating the controls and to which information
from the controlled signalling point(s) are directed.
.PP
This Recommendation is divided into eight sections. The first, is the introduction.
The second describes those procedures in OMAP which are currently defined
for the signalling network. The third describes those operations and
maintenance procedures associated with the exchanges. The fourth describes
those common operations and maintenance procedures that are associated
with the signalling network and exchanges and the fifth section describes
those
capabilities required by OMAP from other layers of the OSI and gives examples
of why the capabilities are required. The sixth section defines timers,
timer values and performance timers. The seventh section provides state
transition
diagrams for the currently defined OMAP procedures. The eighth section
defines the OMAP ASEs.
.RT
.sp 1P
.LP
1.1
\fIDescription of management model\fR
.sp 9p
.RT
.PP
The Signalling System No. 7 Management model is concerned with the control,
coordination, and monitoring of the resources which allow SS No. 7
based communication to take place. More specifically, activities relate
to the way various SS No.\ 7 entities obtain data and cooperate in relation
to
maintaining these resources. Figure\ 1/Q.795 presents a graphical description
of the SS No.\ 7 Management model in relation to the OSI Management model.
.RT
.LP
.sp 2
.bp
.LP
.rs
.sp 25P
.ad r
\fBFigure 1/Q.795, p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
1.1.1
\fIManagement categories\fR
.sp 9p
.RT
.PP
In order to achieve the functionality described above, three
categories of management are identified: Systems Management, (N)\(hyLayer
Management, and (N)\(hyProtocol Management. As previously described, Systems
management monitors, controls, and coordinates resources through the
application layer protocols. The collection of these functions is known
as the Systems Management Application Process (SMAP). (N)\(hyLayer Management
functions are performed within the corresponding (N)\(hyLayer by a local
system. Examples of (N)\(hyLayer functions are measurements and the maintenance
of network routing
tables. (N)\(hyProtocol Management is concerned with a single instance of
communication within the (N)\(hyLayer. It is the responsibility of the
(N)\(hyprotocol to distinguish between management information carried within
the (N)\(hyprotocol and other information. OMAP is generally concerned
with Systems
Management and (N)\(hyLayer Management functions each of which may be considered
a sub\(hyset of Systems Management.
.RT
.sp 1P
.LP
1.1.2
\fIManagement information base\fR
.sp 9p
.RT
.PP
All management information which exists in an open system and which may
be transferred or affected through the use of management protocols
comprises the Management Information Base (MIB). This information may be
provided or accessed by remote systems using OMAP. The exchange of data
may be in the form of either monitoring information or exercise of control.
The
internal structure of the MIB is not specified.
.RT
.sp 1P
.LP
1.2
\fIApplication layer model\fR
.sp 9p
.RT
.PP
The set of functions above the application layer which collectively encompass
systems management is termed Systems Management Application Process (SMAP).
The aspect of the SMAP which is then involved with communications is the
Systems Management Application Entity (SMAE). The SMAE is also known as
the OMAP AE. The OMAP AE consists of a set of one or more Application Service
Elements (ASEs). Currently, two ASEs are defined in the OMAP AE, the
Transaction Capabilities Application Part (TCAP Recommendations Q.771\(hy775),
and the MTP Routing Verification Test (MRVT) (\(sc 8). The MRVT ASE uses
the
services of the TCAP ASE.
.bp
.PP
The SMAP communicates with the OMAP AE via a set of OM\(hyPrimitives at
the Systems Management Service Interface (SMSI). Currently, two primitives
are defined for OMAP: OM\(hyConfirmed\(hyAction, and OM\(hyEvent\(hyReport.
These
Primitives are defined in \(sc 8. These OM\(hyPrimitives are based on the
M\(hyPrimitives used in the Common Management Information Protocol (CMIP)
defined in IS0 9595/6.
.RT
.sp 1P
.LP
1.2.1
\fITransfer categories\fR
.sp 9p
.RT
.PP
There are two categories of data transfer which are of concern to SMAP
and management. These are connectionless service and a connection\(hyoriented
service.
.RT
.sp 1P
.LP
1.2.1.1
\fIConnectionless service\fR
.sp 9p
.RT
.PP
OMAP as currently defined in this Recommendation uses the services of connectionless
TCAP as currently specified in Recommendations Q.771\(hy774.
This service is generally used for those functions which require only a few
messages, e.g.\ MRVT (see \(sc\ 2.1) see Figure 2/Q.795.
.RT
.LP
.rs
.sp 20P
.ad r
\fBFigure 2/Q.795, p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
1.2.1.2
\fIConnection\(hyoriented service\fR
.sp 9p
.RT
.PP
OMAP as currently defined does not offer a connection\(hyoriented
service, however this is an item for further study. This service would
generally be used for those functions which require a number of messages.
See Figure\ 3/Q.795.
.RT
.sp 2P
.LP
\fB2\fR \fBOperations, maintenance and administration procedures for the\fR
\fBsignalling network\fR
.sp 1P
.RT
.sp 1P
.LP
2.1
\fIManagement of routing data\fR
.sp 9p
.RT
.PP
These procedures deal with the creation, modification, deletion,
interrogation, activation and deactivation of routing data. This capability
is provided in two basic modes: \fImultiple\fR and \fIsingle\fR . \fIMultiple
mode\fR provides the capability of dealing with many routing relations,
while \fIsingle mode\fR
deals with a single routing relation.
.RT
.sp 2P
.LP
2.1.1
\fIFunctions\fR
.sp 1P
.RT
.sp 1P
.LP
2.1.1.1
\fICreation\fR
.sp 9p
.RT
.PP
This function provides a means of adding new routing data
associated with routing relations to a node in the network. It could cause
additional information to be added to an existing table or it may involve
adding a completely new table.
.bp
.RT
.LP
.rs
.sp 20P
.ad r
\fBFigure 3/Q.795, p.2b\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
2.1.1.2
\fIModification\fR
.sp 9p
.RT
.PP
This function allows for the modification of existing routing data associated
with routing relations within a particular node.
.RT
.sp 1P
.LP
2.1.1.3
\fIDeletion\fR
.sp 9p
.RT
.PP
This function is the inverse of creation, in that routing data
associated with routing relations will be deleted from the routing
tables.
.RT
.sp 1P
.LP
2.1.1.4
\fIInterrogation\fR
.sp 9p
.RT
.PP
This function provides a means for requesting the routing data in a specified
signalling point.
.PP
For example the user can query a signalling point and the signalling point
will respond with the respective data. This data can then be compared
with the set of data which is expected to be in the signalling point.
.RT
.sp 1P
.LP
2.1.1.5
\fIActivation\fR
.sp 9p
.RT
.PP
Activation initiates the use of specified routing data.
.PP
The activation of routing relations implies that the new data is
actually being used for routing purposes. It may be instantaneous or scheduled
for a later time. Activation is accomplished via the activation procedure
alone or may be a part of the creation, modification and deletion
procedures.
.RT
.sp 1P
.LP
2.1.1.6
\fIDeactivation\fR
.sp 9p
.RT
.PP
Deactivation discontinues the use of specified routing data.
.PP
If a routing table is erroneously changed, another modification must be
made to correct the data in order to continue routing in a sane manner.
If a previous version of the table has been retained, the deactivation
function may cause this table to be used. Deactivation can be either automatic
or may
require manual intervention.
.bp
.RT
.sp 1P
.LP
2.1.1.7
\fIRearrangement\fR
.sp 9p
.RT
.PP
Rearrangement deals with the coordinated change of a set of routing relations
within the signalling network (e.g.\ when an application is moved from
one signalling point to another). This may be handled by requiring that
the
activation of routing relations in the various signalling points be made
(e.g.\ by an operations and maintenance centre) in a
particular order.
.RT
.sp 1P
.LP
2.1.2
\fIInformation elements\fR
.sp 9p
.RT
.PP
The specification of information elements is left for further
study.
.RT
.sp 1P
.LP
2.2
\fICircuit validation test (CVT)\fR
.sp 9p
.RT
.PP
\fINote\fR \ \(em\ The encoding of the CVT messages is for further
study.
.RT
.sp 1P
.LP
2.2.1
\fIGeneral procedures\fR
.sp 9p
.RT
.PP
The purpose of a CVT is to ensure that the two exchanges have
sufficient and consistent translation data for placing a call on a specific
circuit of an interexchange circuit group. A CVT may be initiated by either
exchange on demand by maintenance or operations personnel. The test is to be
performed before a continuity test while turning up a circuit, so that if a
continuity failure is experienced it may be uniquely attributed to a circuit
hardware trouble. Before a test is performed, it is necessary to ensure that
messages are capable of being routed to that exchange.
.RT
.sp 1P
.LP
2.2.2
\fITranslations tested\fR
.sp 9p
.RT
.PP
Both the near end and far end checks are required to perform a
complete CVT. The initiating end starts the test by accessing the circuit
to be tested when stimulated by a local implementation dependent request.
The circuit is identified by an identification code agreed upon by the
two exchanges at
either end of the circuit.
.PP
The translation check at the initiating end must perform adequate
tests to ensure that translation data exists for:
.RT
.LP
1)
deriving a physical appearance for the circuit so that a
transceiver may be connected to it, and
.LP
2)
deriving a circuit identification code (CIC) and routing label so that
a CCS circuit\(hyrelated message may be generated.
.PP
If the near end test fails, the local maintenance personnel is
notified with the reason for the near end failure (e.g.\ failure reason \(em
circuit unequipped). The test is terminated and a CVT request message is not
generated for the circuit under test.
.PP
The far end receiving the CVT request message will check to see if the
CIC indicated in the message is assigned. If the CIC is unassigned, a failure
indication is explicitly returned to the near end via a CVT response message
(rather than via an unequipped CIC message). If the CIC is assigned, the
far end must perform adequate tests to ensure that translation data exists
for deriving a physical circuit appearance from the received routing lable
and the CIC so that a loop or transceiver may be connected to the physical
circuit
appearance. Additionally, the far end must also check that an
identification
.PP
code for the circuit exists for the physical circuit appearance. If the
far end checks fail, the CVT response message will contain the reason for
failure and will include an identification code of the failing exchange
as agreed upon by the two exchanges. If the far end checks pass, the CVT
response message will
contain the far end derived identification code for the circuit. At the near
end, a comparison of the near end and the far end circuit identification
codes are made. If they match, an identification of a successful CVT is
given to the maintenance personnel at the initiating end. If the comparison
fails, a CVT
failure indication with all the relevant data is given to the maintenance
personnel for the purpose of isolating the problem.
.bp
.PP
The CVT response message will also contain data about the circuit with
respect to the characteristics of the interexchange circuit group that
it is
part of. The interexchange circuit group characteristics will include
whether:
.RT
.LP
\(em
odd or even CICs are in control in the case of double
seizing;
.LP
\(em
the blocked circuit group is classified as \*QBlock,
immediately release the call\*U or \*QBlock, as soon as the call is normally
released\*U;
.LP
\(em
whether the interexchange circuit group contains analogue,
digital or a mix of analogue and digital circuits in order to determine if
continuity checks should be performed.
.PP
If the group characteristics are unavailable, the CVT response
must explicitly indicate this with an unavailable indication. Inconsistencies
between the interexchange circuit group characteristics between the two
exchanges must be reported to the initiating end maintenance personnel for
corrective action.
.sp 1P
.LP
2.3
\fIMTP routing verification test (MRVT)\fR
.sp 9p
.RT
.PP
The MTP routing verification test requirements are as
follows:
.RT
.LP
a)
Independence of MTP routing policy.
.LP
b)
Independence of link set failures.
.LP
c)
Use the existing MTP without modifications.
.LP
d)
Response at all tests (positive or negative).
.LP
e)
Independence of the network structure.
.LP
f
)
The procedure must:
.LP
\(em
detect loops in the signalling network;
.LP
\(em
detect excessive length routes;
.LP
\(em
detect unknown destinations;
.LP
\(em
check the bidirectionality of the signalling relations (i.e.\ if SP\
A can reach SP\ B, can SP\ B reach SP\ A?).
.sp 1P
.LP
2.3.1
\fIGeneral procedure considerations\fR
.sp 9p
.RT
.PP
The object of the MTP routing verification test is to determine if the
data of the MTP routing tables in the network are consistent. It is based
on a decentralized test procedure using test messages. It will follow all
possible routes to reach the test destination, while tracking the identities
of STPs crossed. The procedure is independent of signalling link set availability
status. The test is started in any point (SP or STP) for any destination
which is in the MTP routing tables and is stopped at the test destination
or any
intermediate SP at which an error is detected. The test will check the
complete routing tables in the network only if all intermediate signalling
points know the initiator.
.PP
When an inconsistency or failure is detected, local actions are to be specified.
The initiator of the test is alerted. The MRVT procedure is applied to
individual MTP routing tables. If the MTP is to use structured routing
tables (e.g.\ some or all of the entries in the routing tables may refer
to sets of point codes) then the procedure (and/or its initiation) is for
further
study.
.PP
If an MRVA, MRVR, or MRVT message received in an SP contains
information extra to that defined in \(sc\ 2.3, the extra information is
ignored
unless it is contained as spare subfields within defined fields, and then it
will be sent onwards.
.RT
.sp 1P
.LP
2.3.2
\fIThe MRVT messages\fR
.sp 9p
.RT
.PP
The MTP routing verification test procedure uses three Operations, Maintenance,
and Administration Part (OMAP) messages.
.RT
.sp 1P
.LP
2.3.2.1
\fIThe MTP Routing Verification Test (MRVT) message\fR
.sp 9p
.RT
.PP
The routing verification test message (MRVT) is sent from an SP to an adjacent
SP. The MRVT message may use any available signalling route to
reach its destination. It contains:
.RT
.LP
a)
information indicating MRVT;
.LP
b)
the point code of the test destination;
.LP
c)
the initiator point code;
.bp
.LP
d)
the threshold N of the maximum allowed number of STPs
crossed (including the initiator if it is an STP);
.FS
Determined by System
Management Application Process (SMAP)
.FE
.LP
e)
the information indicating that a trace is requested; the
possible values are:
.LP
i)
for all routes which may be used to reach the test
destination the MRVR messages are returned regardless of the result of the
test;
.LP
ii)
no detailed information requested (the MRVR messages sent only if a failure
or inconsistency is detected);
.LP
f
)
the list of STPs crossed together with the initiator point code if this
point has the STP function.
.sp 1P
.LP
2.3.2.2
\fIThe MTP Routing Verification Acknowledgment (MRVA) message\fR
.sp 9p
.RT
.PP
The routing verification acknowledgment (MRVA) message is sent from the
SP receiving an MRVT message to the SP which has sent the MRVT message.
The MRVA message may use any available signalling routes to reach its destination.
It contains:
.RT
.LP
a)
information indicating MRVA;
.LP
b)
information indicating that an MRVR has been sent;
.LP
c)
the reason for any failure (partial or complete). If any
failure has occurred, one or more of the following indications is present:
.LP
i)
detected loop;
.LP
ii)
detected excessive length route;
.LP
iii)
unknown destination point code;
.LP
iv)
MRTV not sent due to inaccessibility (e.g.\ network
blockage or network congestion);
.LP
v)
timer expired (MRVA not received);
.LP
vi)
unknown initiator point code (this result means that the test destination
or an intermediate point does not know the initiator of
the test);
.LP
vii)
test cannot be run due to local conditions
(e.g.\ unavailability of processing resources).
.PP
Note that in the case of success, only a) will be present; in the cases
of partial success and failure, a), b) and c) will be present.
.sp 1P
.LP
2.3.2.3
\fIThe MTP Routing Verification Result (MRVR) message\fR
.sp 9p
.RT
.PP
The MRVR message is sent from an SP to the initiator of the MTP
routing verification test. It contains:
.RT
.LP
a)
information indicating MRVR;
.LP
b)
the test destination point code;
.LP
c)
the result of the test;
.LP
d)
the information field.
.PP
The content of this information field depends on the result of the test.
It contains:
.LP
i)
if the result of the test is \*Qsuccess\*U:
.LP
the point codes of the STPs crossed contained in the MRVT
message;
.LP
ii)
if the result of the test is \*Qdetected loop\*U:
.LP
the point codes of the STPs which are in the loop;
.LP
iii)
if the result of the test is \*Qdetected excessive length
route\*U:
.LP
the point codes of STPs crossed contained in the MRVT message;
.LP
iv)
if the result of the test is \*Qunknown destination point
code\*U:
.LP
no additional information;
.LP
v)
if the result of the test is \*QMRVT not sent due to
inaccessibility\*U:
.LP
the point code of the inaccessible SP;
.LP
vi)
if the result of the test is \*QMRVA not received\*U:
.LP
the identity of the SP(s) from which an MRVA was not received
when expected;
.LP
vii)
if the result of the test is \*Qunknown initiator point
code\*U:
.LP
the point code of the SP returning an MRVA to cause the MRVR to
be sent;
.LP
viii)
if the result of the test is \*Qtest cannot be run due to local conditions\*U:
.LP
no additional information.
.bp
.sp 1P
.LP
2.3.3
\fIInitiation of the MRVT procedure at a Signalling Point\fR
.sp 9p
.RT
.PP
The procedure is started when:
.RT
.LP
a)
New MTP routing data is introduced. It is mandatory that
each signalling relation should pass the MRVT procedure successfully before
being opened to traffic.
.LP
b)
MTP routing data is changed.
.LP
c)
On reception of an unexpected MRVR (due to unknown
Signalling Point).
.LP
d)
On receipt of an MRVT message.
.LP
e)
On demand from local maintenance staff or an operations and maintenance
centre.
.LP
f
)
Periodically at a Signalling Point (having the STP
function) to detect cases of mutilation of routing data. (The period is
network dependent and should be such that the load on the network is not
seriously
increased.)
.PP
In cases c) and f
) above, the \*Qexpected result type\*U field of the MRVT message should
be set to indicate no trace is requested. See
\(sc\ 2.3.2.1.
.LP
2.3.4
\fIThe\fR
\fIMRVT procedure\fR
.sp 1P
.RT
.sp 2P
.LP
2.3.4.1
\fIAt the point initiating the procedure\fR
.sp 1P
.RT
.sp 1P
.LP
2.3.4.1.1
\fIInitial actions\fR
.sp 9p
.RT
.PP
When a signalling point initiates an MRVT procedure, it sends an
MRVT message for each signalling route which is contained in the MTP routing
table to reach the test destination. The destination (DPC) of each of these
messages is the adjacent signalling point within the particular route under
test. If the test destination is an adjacent signalling point, operated
in the associated mode, an MRVT message is not sent to the tested destination
itself.
.PP
When the MRVT procedure is initiated, a timer T1 (see \(sc\ 6) is started.
An SP cannot initiate an MRVT procedure for a test destination until any
previous MRVT procedure for that destination has completed.
.RT
.sp 2P
.LP
2.3.4.1.2
\fISubsequent actions\fR
.sp 1P
.RT
.sp 1P
.LP
2.3.4.1.2.1
\fIReception of an MRVA message\fR
.sp 9p
.RT
.PP
An MRVA message acknowledges an MRVT message previously sent.
.PP
The reception of the last expected MRVA message stops T1. When an MRVA
message is received after T1, it is ignored. When all MRVA messages expected
have been received or when T1 expires, the test is complete and results are
given to SMAP.
.PP
The possible test results at this point in the procedure are listed in
\(sc\ 2.3.2.2\ c).
.PP
The result \*Qunknown initiator point code\*U could be a positive result
(e.g.\ when installing a new SP). A test is positive when all expected
MRVA
messages have been received inside T1 without fault indications.
.RT
.sp 1P
.LP
2.3.4.1.2.2\ \ \fIReception of an MRVR message\fR
.sp 9p
.RT
.PP
The reception of an MRVR message regardless of whether the
receiving SP was the initiator causes the information contained in the
message to be given to SMAP (see \(sc\ 2.3.2.3).
.RT
.sp 2P
.LP
2.3.4.2
\fIIn an intermediate point\fR
.sp 1P
.RT
.sp 1P
.LP
2.3.4.2.1
\fIInitial actions (on reception of an MRVT message)\fR
.sp 9p
.RT
.PP
If the test cannot be run due to local conditions, an MRVR message is sent
to the initiating point, if the initiating point is known to the
intermediate SP, and an MRVA message is sent to the sender of the MRVT. The
MRVR message contents are as described in \(sc\ 2.3.2.3. The MRVA message
contains the indication \*Qtest cannot be run due to local conditions\*U.
The test is
stopped after informing SMAP.
.bp
.PP
If the test can be run, looking at the contained fields in the
received MRVT message, the point determines if the initiating SP is known,
and if the test destination is known in the MTP routing tables. Then:
.RT
.LP
a)
If the initiating SP is unknown, an MRVA message is returned with result
\*Qunknown initiating SP\*U and the value of the \*QMRVR sent\*U indicator
denotes that the MRVR message was not sent. The test is then stopped, after
informing SMAP.
.LP
b)
If the destination is unknown, the point acknowledges the
received MRVT message by an MRVA message with indication \*Qunknown destination
point code\*U, and MRVR message is sent to the initiating point. An indication
is given to SMAP and the test stopped.
.LP
c)
If the initiating SP of the test as well as the test
destination exist within the SPs routing tables, the SP makes a list \*QA\*U
of the following adjacent SPs:
.LP
i)
STPs used to route to the destination (according to
the MTP routing tables), excluding the SP from which the MRVT message was
received,
.LP
ii)
the tested destination, if this is adjacent.
.PP
The SP then compares the list of STPs crossed contained in the
MRVT message with its own list \*QA\*U for the following conditions:
.LP
i)
If the point code of an SP is already in the list of STPs
crossed contained in the MRVT message, a loop is detected. An MRVR message
is sent to the initiator of the test with the indications described in
\(sc\ 2.3.2.3, then an MRVA message is sent to the point which has sent
the MRVT message with the indication \*Qdetected loop\*U. The test is stopped
(MRVT messages are not
regenerated), after SMAP is informed.
.LP
ii)
If the point code of an SP is not in the list of STPs
crossed contained in the MRVT message and if the size of the list is equal
to a threshold N in the MRVT message, an excessive length route is detected.
An MRVR message is sent to the initiator of the test with the indications
described in \(sc\ 2.3.2.3, then an MRVA message is sent to the point which
has sent the MRVT
message with the indication \*Qdetected excessive length route\*U. The test is
stopped (MRVT messages are not regenerated), after SMAP is informed.
.LP
iii)
If it is impossible to route an MRVT message, an MRVR
message is sent to the initiator of the test with the indications described
in \(sc\ 2.3.2.3, then an MRVA message containing the indication \*QMRVT
not sent due to inaccessibility\*U is sent to the point which has sent
the MRVT message. The
test is stopped (no MRVT messages are regenerated), after SMAP is informed.
.LP
iv)
In other cases a timer T1 is started, and MRVT messages are sent to all
the SPs in list \*QA\*U. When an MRVT message is sent by an STP, the
STP adds its identity in the MRVT message sent.
.sp 1P
.LP
2.3.4.2.2\ \ \fISubsequent actions (on reception of an MRVA message)\fR
.sp 9p
.RT
.PP
The reception of an MRVA message acknowledges the corresponding
MRVT message previously sent. The timer is stopped when all the expected
MRVA messages have been received.
.PP
MRVA message is sent when all expected MRVA messages have been
received. The result of the test contains the different results from the
MRVAs received.
.PP
If any MRVA message contained both the result \*Qunknown initiating SP\*U
and the value of the \*QMRVR sent\*U indicator denotes that the MRVR was
not sent, an MRVR is returned to the initiator.
.PP
If one (or several) MRVA message is not received before T1 expires, an
MRVA message is sent and an MRVR message is sent to the initiator of the
test with the indications described in \(sc\ 2.3.2.3.
.PP
If an MRVA message cannot be sent, no action is taken.
.PP
If an MRVA message is received after T1 expires, it is ignored.
.RT
.sp 1P
.LP
2.3.4.3
\fIAt the test destination receiving an MRVT message\fR
.sp 9p
.RT
.PP
On reception of an MRVT message, the test destination checks that the initiator
of the test is known.
.PP
If the initiator is unknown, an MRVA message is sent to the point
which had sent the MRVT message. This MRVA message contains the result
\*Qunknown initiator point code\*U and the \*QMRVR sent\*U indicator set
to denote that the MRVR was not sent.
.bp
.PP
If the initiator of the test is known, the test is finished with
success and the following actions are taken:
.RT
.LP
a)
If the MRVT message received contains the indication that a trace is
expected, (see \(sc\ 2.3.2.1) an MRVR message is sent to the initiator
of the test with the indications described in \(sc\ 2.3.2.3. An MRVA message
is then sent to the point which had sent the MRVT message.
.LP
b)
If the MRVT message received contains the indication that a trace is
not expected, (see \(sc\ 2.3.2.1), an MRVA message is sent to the point
which had sent the MRVT message. No MRVR message is sent.
.PP
If an MRVA message cannot be sent, no action is taken.
.sp 1P
.LP
2.4
\fIReception of a message for an unknown destination\fR
.sp 9p
.RT
.PP
When an indication is received from the MTP due to the reception of a message
for an unknown destination, an MRVR message is sent to the point
which has sent the messages with the indications described in \(sc\ 2.3.2.3.
.PP
When a point receives such an unexpected MRVR message, an indication is
given to SMAP and an MRVT is started.
.RT
.sp 1P
.LP
2.5
\fISCCP routing verification test (SRVT)\fR
.sp 9p
.RT
.PP
The SCCP routing verification test requirements are as
follows:
.RT
.LP
a)
No modification should be needed to the SCCP protocol
specification.
.LP
b)
The SRVT should be independent of the SCCP routing policy.
.LP
c)
The SRVT should be independent from the network structure, considering
the SCCP routing points.
.LP
d)
The SRVT is not required to verify MTP routing correctness (the MRVT
is expected to do this).
.LP
e)
A response (either positive or negative) is to be given to all tests.
.LP
f
)
The procedure should:
.LP
\(em
Be able to check all possible SCCP routes, including:
.LP
i)
parallel SCCP routing points (this is understood to mean multiple translation
points);
.LP
ii)
serial SCCP routing points (this is understood to mean multiple translation
points);
.LP
iii)
multiple destinations corresponding to the tested
Global title (this is understood to be multiple signalling points/subsystem
numbers where SCCP permits a maximum of two destinations to be derived
from a Global title).
.LP
\(em
Detect loops in the SCCP routing.
.LP
\(em
Detect unknown destination (a destination corresponds to the tested Global
title).
.LP
\(em
Verify Global Title Translation data for accuracy,
completeness, and inconsistency.
\fB
.sp 1P
.LP
2.5.1
\fIGeneral procedure considerations\fR
.sp 9p
.RT
.PP
The general procedure considerations of the SRVT are left for
further study.
.RT
.sp 1P
.LP
2.5.2
\fIThe SRVT messages\fR
.sp 9p
.RT
.PP
The SRVT mesages are left for further study.
.RT
.sp 1P
.LP
2.5.3
\fIInitiation of the SRVT procedure\fR
.sp 9p
.RT
.PP
Initiation of the SRVT procedure is left for further study.
.RT
.sp 1P
.LP
2.5.4
\fIThe SRVT procedure\fR
.sp 9p
.RT
.PP
The specification of the SRVT procedure is left for further
study.
.RT
.sp 1P
.LP
2.6
\fILong\(hyterm measurement collection\fR
.sp 9p
.RT
.PP
The measurements to be taken are given in Recommendation\ Q.791.
.PP
Periodically, at the same time, every signalling point collects the
required data. The data collected may be transferred toward the appropriate
signalling point(s) (e.g.\ an operations and maintenance centre) either on
demand or on a scheduled basis.
.PP
The procedures and means used for transfer of data are for further
study.
.bp
.RT
.sp 2P
.LP
2.6.1
\fIFunctions\fR
.sp 1P
.RT
.sp 1P
.LP
2.6.1.1
\fIParameter intialization\fR
.sp 9p
.RT
.PP
This function initializes, in a signalling point, the destination address(es)
to which measurements will be transferred, sets up default
parameters describing which indications should be reported and, if scheduled,
when the measurements should be transferred.
.RT
.sp 1P
.LP
2.6.1.2
\fIParameter modification\fR
.sp 9p
.RT
.PP
This function allows modifications to the default measurements
which are collected in a signalling point. It may not be used to modify the
measurements duration nor to remove those measurements described as being
obligatory in Recommendation\ Q.791. The following list represents the set of
modifications currently available and the information elements that must be
provided at the controlled signalling point. Other modifications have been
left for further study.
.RT
.LP
a)
\fIAllow\fR
\fImeasurement collection\fR is used to indicate that a particular measurement(s)
should be collected for a particular
controlling signalling point.
.LP
Command, controlling address, measurement 1, measurement 2, etc.
.LP
b)
\fIInhibit measurement collection\fR is used to indicate that a particular
measurement(s) should not be collected for a particular controlling signalling
point.
.LP
Command, controlling address, measurement 1, measurement 2,
etc.
.sp 2P
.LP
2.6.2
\fIInformation elements\fR
.sp 1P
.RT
.PP
2.6.2.1
\fICommand indicates the function to be performed\fR
.sp 9p
.RT
.PP
2.6.2.2
\fIControlling address\fR is the address of the signalling point
from which commands are sent and to which the measurements are transferred.
.PP
2.6.2.3
\fIMeasurement\fR is the name of a particular measurement which
should (not) be collected.
.sp 1P
.LP
2.7
\fIOn\(hyoccurrence measurement reporting\fR
.sp 9p
.RT
.PP
These procedures deal with the transfer and control of the
measurements described in Recommendation\ Q.791 (Monitoring and measurements
for Signalling System No.\ 7 networks) as being reported on occurrence.
The record of an on\(hyoccurrence measurement is referred to as an \fIevent
indicator\fR or
\fIindicator\fR .
.RT
.sp 2P
.LP
2.7.1
\fIFunctions\fR
.sp 1P
.RT
.sp 1P
.LP
2.7.1.1
\fIParameter initialization\fR
.sp 9p
.RT
.PP
This function initializes, in a signalling point, the destination address(es)
to which reporting should be made (e.g. an OMC), sets up default
parameters describing which indicators should be reported, what thresholds
are associated with the indicators and which indicators should be logged
along with the establishment of logging files (see \(sc\ 2.7.1.4).
.RT
.sp 1P
.LP
2.7.1.2
\fIParameter modification\fR
.sp 9p
.RT
.PP
\fIParameter modification\fR allows modifications to be made to the
default indicators which are to be logged and transmitted. In addition, it
allows the modification of the destination addresses that are associated
with particular indicators. The following list represents the set of modifications
available and the information elements that must be provided at the controlled
signalling point. Other modificaitons have been left for further
study.
.RT
.LP
a)
\fICreate a\fR
\fIlogging file\fR | is used to create a
logging file and set the number of event indicators to be logged before
overwriting old indicators:
.LP
command, controlling address, file name, size.
.LP
b)
\fIChange a controlling address\fR | is used to modify a
controlling address (e.g.\ of an OMC) to which reports should be made:
.LP
command, old controlling address, new controlling address.
.bp
.LP
c)
\fIAllow event logging\fR | is used to indicate that a particular indicator(s)
should be logged and optionally assign a threshold to the
indicator:
.LP
command, controlling address, event indicator 1,
threshold\ 1, etc.
.LP
d)
\fIInhibit event logging\fR | is used to indicate that a
particular indicator(s) should not be logged:
.LP
command, controlling address, event indicator 1, event
indicator\ 2, etc.
.LP
e)
\fIChange event logging threshold\fR | is used to modify a
threshold associated with a particular indicator(s) to be logged:
.LP
command, controlling address, event indicator\ 1, threshold\ 1,
etc.
.LP
f
)
\fIAllow\fR
\fIevent reporting\fR | is used to indicate that a particular indicator(s)
should be reported to a controlling address and optionally assign a threshold
to the indicator:
.LP
command, controlling address, event indicator\ 1, threshold\ 1,
etc.
.LP
g)
\fIInhibit event reporting\fR | is used to indicate that a
particular indicator(s) should not be reported:
.LP
command, controlling address, event indicator 1, event
indicator\ 2, etc.
.LP
h)
\fIChange event reporting threshold\fR | is used to modify a
threshold associated with a particular indicator(s) to be reported:
.LP
command, controlling address, event indicator\ 1, threshold\ 1,
etc.
.sp 1P
.LP
2.7.1.3
\fIEvent indicator reporting\fR
.sp 9p
.RT
.PP
This function notifies a specified controlling address of
on\(hyoccurrence measurements by the transfer of an event indicator. The
following information elements are included in each message that is sent
for reporting
purposes:
.RT
.LP
event type, controlled address, affected address, time stamp,
additional information.
.sp 1P
.LP
2.7.1.4
\fIRecovery of recent on\(hyoccurrence measurement history\fR
.sp 9p
.RT
.PP
In the event of failure of a controlling signalling point (e.g.\ an operations
maintenance centre) or a signalling relation to that controlling
signalling point, a recovery procedure is required to allow the controlling
signalling point to recover a recent history of on\(hyoccurrence measurements
in the signalling network. This is accomplished by maintaining a log of
the last N event indicators, at the signalling point, which may be requested
by the
controlling signalling point after recovery.
.PP
The logging file may also be used to store event indicators which have
not been requested for reporting by the controlling signalling point, for
example, measurements with lower thresholds for logging than for reporting.
.PP
The maximum number of event indicators logged (N) is for further
study.
.RT
.sp 2P
.LP
2.7.2
\fIInformation elements\fR
.sp 1P
.RT
.PP
2.7.2.1
\fIControlling address\fR | is the address of the signalling point from
which commands are sent and to which the event indicators are reported.
.sp 9p
.RT
.PP
2.7.2.2
\fIControlled address\fR | is the address of the signalling point
which is being controlled and from which measurements are being reported.
.PP
2.7.2.3
\fIAffected address\fR | is the address of the signalling point about
which an event indicator pertains.
.PP
2.7.2.4
\fICommand\fR | indicates a function to be performed.
.PP
2.7.2.5
\fIFile name\fR | is the name of a file at the signalling point where
logging is to be performed.
.PP
2.7.2.6
\fISize (N)\fR | is the maximum number of event indicators that may
be recorded in an event log.
.PP
2.7.2.7
\fIEvent type\fR | describes the on\(hyoccurrence measurement associated
with an event indicator.
.PP
2.7.2.8
\fIThreshold\fR | represents some threshold associated with an
on\(hyoccurrence measurement before its associated event indicator is reported
or logged.
.PP
2.7.2.9
\fITime stamp\fR | represents the unique network time when the event
indicator was generated.
.LP
2.7.2.10\ \ \fIAdditional information\fR | is any additional information
associated with the on\(hyoccurrence measurement being indicated (e.g.\
the link ID of a signalling link experiencing a failure).
.bp
.LP
.sp 1P
.LP
2.8
\fIDelay measurements\fR
.sp 9p
.RT
.PP
These procedures deal with measuring delays across the signalling network,
whether these delays are measured point\(hyto\(hypoint or round trip.
.RT
.sp 1P
.LP
2.8.1
\fIFunctions\fR
.sp 9p
.RT
.PP
The specifications of functions is left for further study.
.RT
.sp 1P
.LP
2.8.2
\fIInformation elements\fR
.sp 9p
.RT
.PP
The specification of information elements is left for further
study.
.RT
.sp 1P
.LP
2.9
\fIClock initialization\fR
.sp 9p
.RT
.PP
The clock initialization procedures provide a means for setting
clocks in a signalling point for operations and maintenance and for other
purposes. Its main function allows clocks in the network to be set up to a
unique network time.
.RT
.sp 1P
.LP
2.9.1
\fIFunctions\fR
.sp 9p
.RT
.PP
The specification of specific functions has been left for further study.
.RT
.LP
.sp 1P
.LP
2.9.2
\fIInformation elements\fR
.sp 9p
.RT
.PP
The specification of information elements is left for further
study.
.RT
.sp 1P
.LP
2.10
\fIReal\(hytime control\fR
.sp 9p
.RT
.PP
These procedures allow for automatic or manual controls to be taken in
a controlled signalling point based on input from a controlling signalling
point. The controlling signalling point may initiate these procedures based
on input from procedures like the \fIon\(hyoccurrence measurement reporting\fR
procedures.
.RT
.sp 1P
.LP
2.10.1
\fIFunctions\fR
.sp 9p
.RT
.PP
The specification of functions is left for further study.
.RT
.sp 1P
.LP
2.10.2
\fIInformation elements\fR
.sp 9p
.RT
.PP
The specification of information elements is left for further
study.
.RT
.sp 1P
.LP
2.11
\fIOperations\fR
.sp 9p
.RT
.PP
These procedures provide a capability to perform operations, such as activation
of links, within the signalling network.
.RT
.LP
.sp 1P
.LP
2.11.1
\fIFunctions\fR
.sp 9p
.RT
.PP
The specification of functions is left for further study.
.RT
.sp 1P
.LP
2.11.2
\fIInformation elements\fR
.sp 9p
.RT
.PP
The specification of information elements is left for further
study.
.RT
.sp 2P
.LP
\fB3\fR \fBOperations and maintenance procedures for the exchanges\fR
.sp 1P
.RT
.PP
This paragraph deals with those procedures associated with the
operations and maintenance of exchanges and remains as a topic for further
study. A basis for the definition of this paragraph will be
Recommendations\ Q.511, Q.512, Q.542 and Q.544, Supplement\ 6 of
Fascicle\ II.3 and Recommendation\ Z.318.
.RT
.sp 2P
.LP
\fB4\fR \fBOperations and maintenance procedures for both the Signalling\fR
\fBNetwork and Exchanges\fR
.sp 1P
.RT
.PP
This section deals with those procedures associated with operations and
maintenance that are found in common with both the Signalling Network and
the Exchanges. See OMAP procedures and protocols in this document and also
Recommendations\ Q.541, Q.543, Q.544 and M.30. The contents of this paragraph
remains as a topic for further study.
.bp
.RT
.sp 2P
.LP
\fB5\fR \fBRequirements on the protocols used to support the operations\fR
\fBand maintenance procedures\fR
.sp 1P
.RT
.PP
It is assumed that the procedures defined in the previous
paragraphs
will make use of the protocols defined by CCITT in the various functional
layers of the OSI model. This paragraph describes the capabilities required
from these layers. No attempt is made to allocate the requirements to specific
functional layers of the OSI model. See OMAP procedures and protocols in
this document and also Recommendations\ Q.541, Q.543, Q.544 and M.30.
.RT
.sp 1P
.LP
5.1
\fIAddressing capability\fR
.sp 9p
.RT
.PP
This capability allows the user of the OMAP to address applications in
nodes in the signalling network or to applications in nodes that may exist
in any interconnected network.
.RT
.sp 1P
.LP
5.2
\fIDistribution capability\fR
.sp 9p
.RT
.PP
This capability is responsible for delivering information to the
appropriate operations and maintenance application within the destination
node.
.RT
.sp 1P
.LP
5.3
\fIConnection\(hyoriented communication capability\fR
.sp 9p
.RT
.PP
This capability establishes a connection, whether physical or
logical, for the purposes of transporting operations and maintenance
information between two signalling points. This is required, for example,
for the interactions between a controlling signalling point where MML commands
are entered and a controlled signalling point where the functions controlled
by the MML commands exist.
.RT
.sp 1P
.LP
5.4
\fIConnectionless communication capability\fR
.sp 9p
.RT
.PP
The capability allows the transfer of operations and maintenance
information between two signalling points without the establishment of a
connection. This is required, for example, to transfer event indicators
used in the \fIon\(hyoccurrence measurement reporting\fR .
.RT
.sp 1P
.LP
5.5
\fIFile transfer capability\fR
.sp 9p
.RT
.PP
This capability provides the means for communications between
operations and maintenance applications which require file transfers. This
is required, for example, to transport files generated by \fIlong\(hyterm
measurement\fR \fIcollection\fR .
.RT
.sp 1P
.LP
5.6
\fIOther capabilities\fR
.sp 9p
.RT
.PP
Other capabilities which may be required are for further
study.
.RT
.sp 2P
.LP
\fB6\fR \fBTimer definitions and values, and performance time definitions\fR
\fBand values\fR
.sp 1P
.RT
.sp 1P
.LP
6.1
\fITimer definitions and values\fR
.sp 9p
.RT
.PP
T1 at a signalling point (Near End Signalling Point) initiating an MRVT
is the guard time waiting for all MRVA messages in response to the MRVT
messages sent from the Near End SP.
.RT
.sp 1P
.ce 1000
T1 (Near End SP) = D(N +1)
.ce 0
.sp 1P
.LP
where N is defined in \(sc\ 2.3.2.1\ d), and D is defined in \(sc\ 6.2 below.
.sp 9p
.RT
.PP
T1 at an intermediate signalling point is the guard time
associated with a received MRVT message, waiting for all MRVA messages in
response to all MRVT messages sent.
.LP
T1 (Intermediate SP) = T1 deduced from the received MRVT message \(em D
.bp
.sp 1P
.ce 1000
.ce 0
.sp 1P
.LP
6.2
\fIPerformance time definitions and values\fR
.sp 9p
.RT
.sp 1P
.ce 1000
D = Max(d1) + Max(d2) + Max(d3) + Max(d4)
.ce 0
.sp 1P
.LP
where
.sp 9p
.RT
.LP
d1:
time to transfer an MRVT message.
.LP
d2:
time to take into account an MRVT message received.
.LP
\(em
In an Intermediate SP, performance time d2 is the time between the reception
of an MRVT message and the sending of the MRVT messages to the concerned
SPs (or the sending of the MRVA message to the point which has sent the
MRVT message when a problem is detected).
.LP
\(em
In the tested destination, performance time d2 is the time between the
reception of an MRVT message and the sending of the MRVA
message to the point which has sent the MRVT message.
.LP
d3:
time to transfer an MRVA message.
.LP
d4:
time to take into account an MRVA received.
.LP
\(em
In an Intermediate SP, performance time d4 is the time between the reception
of the last MRVA message and the sending of the MRVA
message to the point which has sent the MRVT message.
.ce
\fBH.T. [T1.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
cw(48p) | cw(72p) .
Performance time Estimated maximum value
_
.T&
cw(48p) | lw(72p) .
d1 2 seconds (provisional)
_
.T&
cw(48p) | lw(72p) .
d2 3 seconds (provisional)
_
.T&
cw(48p) | lw(72p) .
d3 2 seconds (provisional)
_
.T&
cw(48p) | lw(72p) .
d4 1 second (provisional)
_
.T&
cw(48p) | lw(72p) .
D 8 seconds (provisional)
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T1.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 2P
.LP
\fB7\fR \fBState transition diagrams\fR
.sp 1P
.RT
.sp 1P
.LP
7.1
\fIGeneral\fR
.sp 9p
.RT
.PP
Paragraph 7 contains the description of the test functions
described in \(sc\(sc\ 2.2 and 2.3 in the form of state transition diagrams
according to the CCITT Specification and Description Language (SDL).
.PP
A set of diagrams is provided for each of the following
tests:
.RT
.LP
a)
Circuit Validation Test (CVT), described in \(sc\ 2.2;
.LP
b)
MTP Routing Verification Test (MRVT), described in
\(sc\ 2.3.
.sp 1P
.LP
7.2
\fIAbbreviations used in Figures\ 4/Q.795 to 5/Q.795\fR
.sp 9p
.RT
.LP
CVT
Circuit validation test;
.LP
CKT
Circuit;
.LP
MRVT MTP
Routing verification test;
.LP
MRVA MTP
Routing verification acknowledgement;
.LP
MRVR MTP
Routing verification result;
.LP
PC
Point code;
.LP
REQ
Request;
.LP
RESP
Response;
.LP
SMAP
System management application process.
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure 4/Q.795, p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure 5/Q.795 Sheet 1 of 3, p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure 5/Q.795 Sheet 2 of 3, p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure 5/Q.795 Sheet 3 of 3, p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 2P
.LP
\fB8\fR \fBASEs\fR
.sp 1P
.RT
.PP
In the event of a conflict between \(sc\ 2 and \(sc\ 8, then \(sc\ 2 will
take precedence.
.RT
.sp 1P
.LP
8.
\fIMRVT ASE\fR |
.FS
See X.208 and X.209 for description of formal notation.
.FE
.sp 9p
.RT
.PP
The MRVT ASE provides the services accessed via the two
OM\(hyprimitives OM\(hyCONFIRMED\(hyACTION and OM\(hyEVENT\(hyREPORT. These
are described in Figure\ 6/Q.795
.FS
Derived from ISO\ 9596.
.FE
. MRVT uses a particular instance of each primitive. testRoute is the CnfActionType
of the OM\(hyCONFIRMED\(hyACTION
primitive, while routeTrace is the EventType of the OM\(hyEVENT\(hyREPORT
primitive. Each is described below with the appopriate arguments (ActionArg
for testRoute and EventInfo for routeTrace) and, for testRoute, the appropriate
ActionResults and ActionErrors. For both OM\(hyprimitives in Figure\ 6/Q.795,
the InvokeID in the respective primitives is the InvokeID passed to TCAP,
the ResourceClass
indicates MTP Routing Tables, and the ResourceInstance contains the point
code of the test destination. In addition, the accessControl argument in
OM\(hyCONFIRMED\(hyACTION is absent. The testRoute Action makes use of
the BEGIN
message with result (MRVA) returning in an END. The routeTrace Event (MRVR)
uses a BEGIN message with pre\(hyarranged end.
.RT
.sp 1P
.LP
8.1.1
\fItestRoute Action\fR
.sp 9p
.RT
.PP
The testRoute Action is invoked to initiate an MTP routing
verification test. At the initiator node, this invocation is requested
by the local SMAP. At subsequent nodes, the Action is requested implicitly
by the
receipt of a testRoute Action invocation. A successful reply indicates
successful completion of the test at the point it was invoked and, implicitly,
at all subsequent points where the test was invoked. A failure indication
is
returned to indicate that the test failed in this or a subsequent node.
.RT
.ce
\fBH.T. [T2.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
cw(54p) | cw(42p) | cw(30p) | cw(42p) .
testRoute CNF\(hyACTION \fITimer\fR = T1 \fIClass\fR = 1 \fICode\fR = 00000001
_
.T&
lw(96p) | cw(30p) | cw(42p) .
\fIActionArg\fR \fIOpt/Man\fR \fIReference\fR
_
.T&
lw(96p) | cw(30p) | cw(42p) .
initiating SP M 8.1.1.1.1
.T&
lw(96p) | cw(30p) | cw(42p) .
traceRequested M 8.1.1.1.2
.T&
lw(96p) | cw(30p) | cw(42p) .
threshold M 8.1.1.1.3
.T&
lw(96p) | cw(30p) | cw(42p) .
pointCodesTraversed M 8.1.1.1.4
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T2.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.ce
\fBH.T. [T3.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(180p) .
testRoute CNF\(hyACTION
.T&
lw(180p) .
ACTIONARG SEQUENCE {
.T&
lw(180p) .
{
initiating SP [0] IMPLICIT PointCode,
traceRequested [1] IMPLICIT BOOLEAN,
threshold [2] IMPLICIT INTEGER,
pointCodesTraversed [3] IMPLICIT PointCodeList
}
.T&
lw(180p) .
\ \ \ }
.T&
lw(180p) .
{
ACTIONRESULT
empty
SPECIFICERRORS
{ ailure, partialSucces }
}
.T&
lw(180p) .
::=1
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T3.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 2P
.LP
8.1.1.1
\fItestRoute Action Arguments\fR
.sp 1P
.RT
.sp 1P
.LP
8.1.1.1.1
\fIinitiating SP\fR
.sp 9p
.RT
.PP
The initiating SP identifies the original requestor of the test. It is
of type PointCode, defined as an octet string.
.RT
.ce
\fBH.T. [T4.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(60p) | lw(60p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(60p) | lw(60p) .
initiating SP 10000000
_
.T&
lw(120p) .
\fIContents\fR
_
.T&
lw(120p) .
{
Bit 0 contains the first bit of the point code,
}
.T&
lw(120p) .
{
Bit 1 contains the second bit of the point code, etc.
}
_
.T&
cw(120p) .
PointCode ::= OCTET STRING
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T4.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
8.1.1.1.2\ \ \fItraceRequested\fR
.sp 9p
.RT
.PP
traceRequested indicates that a trace of all routes used to reach the destination
should be reported to the originator (the routeTrace Event is described
in \(sc\ 8.1.2). It is of type BOOLEAN.
.RT
.ce
\fBH.T. [T5.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(54p) | lw(120p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(54p) | lw(120p) .
traceRequested 10000001
_
.T&
lw(54p) | lw(120p) .
\fIContents\fR \fIMeaning\fR
_
.T&
lw(54p) | lw(120p) .
TRUE (=1) {
trace was requested, return trace information on success and failure.
}
.T&
lw(54p) | lw(120p) .
FALSE (=0) {
trace not requested, return trace information only on
failure.
}
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T5.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
8.1.1.1.3\ \ \fIthreshold\fR
.sp 9p
.RT
.PP
The originator sets a maximum threshold level of signalling points (SP)
which are allowed to be crossed in the course of the test (including the
initiator if it is an STP). This aids in detecting overly long routes.
This
threshold is an integral number of SPs, thus it is of type INTEGER.
.RT
.ce
\fBH.T. [T6.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(60p) | lw(60p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(60p) | lw(60p) .
threshold 10000010
_
.T&
lw(120p) .
\fIContents\fR
_
.T&
lw(120p) .
{
Integer number represented in binary.
}
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T6.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
8.1.1.1.4\ \ \fIpointCodesTraversed\fR
.sp 9p
.RT
.PP
As each SP is crossed, it adds its own point code to the list of
point codes traversed. This aids in detecting loops and is also useful
information in case of a failure or if a route trace is requested. It is
a list of point codes thus of type PointCodeList. This PointCodeList could
be
empty.
.RT
.ce
\fBH.T. [T7.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(60p) | lw(60p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(60p) | lw(60p) .
pointCodesTraversed 10100011
_
.T&
lw(120p) .
\fIContents\fR
_
.T&
lw(120p) .
{
Sequence of PointCodes, tagged as `PointCode' with the contents
indicating the exact point code.
}
_
.T&
cw(120p) .
{
PointCodeList ::= SEQUENCE OF PointCode
}
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T7.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
8.1.1.2
\fIAction Results\fR
.sp 9p
.RT
.PP
There are no contents in a successful return indication.
.RT
.sp 1P
.LP
8.1.1.3
\fIAction Errors\fR
.sp 9p
.RT
.PP
SpecificErrors are possible errors which can occur during this test which
are unique to this test. These specific errors are in addition to the
errors already identified in the OM\(hyACTION service and appear as parameters
to the Processing Failure Error.
.RT
.sp 1P
.LP
8.1.1.3.1\ \ \fIfailure\fR
.sp 9p
.RT
.PP
failure indicates a condition of total failure, where no route
worked correctly. Most often this will be used as a failure indication
from the point which detects the error and does not invoke any further
testRoute
Actions. The failure SpecificError has with it a parameter to indicate the
error condition causing the failure. This parameter failureType is represented
as a big string. In addition, the second parameter is to be used when
failureType indicates the error Unknown initiating SP. traceSent indicates
whether or not a routeTrace Event has been invoked to report trace information.
It is necessary to indicate this for this error since the node detecting
the
error cannot send the routeTrace, thus the previous node must. traceSent
is a type of BOOLEAN.
.bp
.RT
.ce
\fBH.T. [T8.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(48p) | lw(36p) .
\fISpecific Error\fR \fICode\fR
_
.T&
lw(48p) | lw(36p) .
failure 00000001
_
.T&
lw(48p) | lw(36p) .
\fIParameters\fR \fIReferences\fR
_
.T&
lw(48p) | lw(36p) .
failureType 8.1.1.3.1
.T&
lw(48p) | lw(36p) .
traceSent 8.1.1.3.1
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T8.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.ce
\fBH.T. [T9.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(36p) | lw(60p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(36p) | lw(60p) .
failureType 10000000
_
.T&
cw(36p) | lw(60p) .
\fIBit\fR \fIMeaning\fR
_
.T&
cw(36p) | lw(60p) .
0 detectedLoop
.T&
cw(36p) | lw(60p) .
1 excessiveLengthRoute
.T&
cw(36p) | lw(60p) .
2 unknownResourceInstance
.T&
cw(36p) | lw(60p) .
3 routeInaccessible
.T&
cw(36p) | lw(60p) .
4 processingFailure
.T&
cw(36p) | lw(60p) .
5 unknown Initiating SP
.T&
cw(36p) | lw(60p) .
6 timerExpired
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T9.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.ce
\fBH.T. [T10.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(36p) | lw(90p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(36p) | lw(90p) .
traceSent 10000001
_
.T&
lw(36p) | lw(90p) .
\fIContents\fR \fIMeaning\fR
_
.T&
lw(36p) | lw(90p) .
TRUE {
the trace information was sent
}
.T&
lw(36p) | lw(90p) .
FALSE {
the trace information was not sent
}
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T10.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.ce
\fBH.T. [T11.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(150p) .
{
failure SPECIFICERROR
.line
\fBfailure\fR
PARAMETER SEQUENCE
{ ailureType [0] IMPLICIT FailureString,
.line
traceSent [1] IMPLICIT BOOLEA }
\fBfailure\fR
::=1
}
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T11.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.ce
\fBH.T. [T12.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(150p) .
{
FailureString ::= BITSTRING
detectedLoop [0],
excessiveLengthRoute [1],
unknownResourceInstance [2],
routeInaccessible [3],
processingFailure [4],
unknown Initiating SP [5],
timerExpired [6]
}
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T12.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
8.1.1.3.2\ \ \fIPartial Success\fR
.sp 9p
.RT
.PP
This indication is given when at least one routeTest Action
invocation failed and at least one succeeded (at least partially). In this
case, each type of error that occurred will be noted and sent in the final
reply. The format and contents of partial success are the same as failure.
.RT
.ce
\fBH.T. [T13.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(48p) | lw(36p) .
\fISpecific Error\fR \fICode\fR
_
.T&
lw(48p) | lw(36p) .
partialSuccess 00000010
_
.T&
lw(48p) | lw(36p) .
\fIParameters\fR \fIReferences\fR
_
.T&
lw(48p) | lw(36p) .
failureType 8.1.1.3.1
.T&
lw(48p) | lw(36p) .
traceSent 8.1.1.3.1
_
.T&
lw(180p) .
{
partialSuccess\ SPECIFICERROR
.line
PARAMETER SEQUENCE\ { ailureType [0] IMPLICIT FailureString,
\fBPARAMETER SEQUENCE\fR
\ traceSent [1] IMPLICIT BOOLEA }
::=2
}
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T13.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
.sp 2
8.1.2
\fIrouteTrace Event\fR
.sp 9p
.RT
.PP
The routeTrace Event reports trace information. Trace information consists
of zero, one or more point codes, such as the point code detecting an error
or the entire list of point codes traversed along a route. This event is
invoked either at the explicit request of the originating node (indicated
by
traceRequested, see \(sc\ 8.1.1.1.2) or by failure at any point along the
route.
This event is not confirmed, therefore no replies to this invocation are
expected (no error or succes indications are expected).
.RT
.ce
\fBH.T. [T14.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
cw(54p) | cw(36p) | cw(36p) | cw(42p) .
routeTrace Event \fITimer\fR = 0 \fIClass\fR = 4 \fICode\fR = 00000010
_
.T&
lw(90p) | cw(36p) | cw(42p) .
\fIEventInfo\fR \fIOpt/Man\fR (see Note) \fIReference\fR
_
.T&
lw(90p) | cw(36p) | cw(42p) .
success O 8.1.2.1.1
.T&
lw(90p) | cw(36p) | cw(42p) .
detectedLoop O 8.1.2.1.2
.T&
lw(90p) | cw(36p) | cw(42p) .
excessiveLengthRoute O 8.1.2.1.3
.T&
lw(90p) | cw(36p) | cw(42p) .
unknownResource Instance O 8.1.2.1.4
.T&
lw(90p) | cw(36p) | cw(42p) .
routeInaccessible O 8.1.2.1.5
.T&
lw(90p) | cw(36p) | cw(42p) .
processingFailure O 8.1.2.1.6
.T&
lw(90p) | cw(36p) | cw(42p) .
unknown Initiating SP O 8.1.2.1.7
.T&
lw(90p) | cw(36p) | cw(42p) .
timerExpired O 8.1.2.1.8
.TE
.LP
\fINote\fR
\ \(em\ One and only one of these parameters must be present.
.nr PS 9
.RT
.ad r
\fBTable [T14.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.ce
\fBH.T. [T15.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(150p) .
{
routeTrace EVENT
EVENTINFO CHOICE [
success [0] IMPLICIT PointCodeList,
detectedLoop [1] IMPLICIT PointCodeList,
excessiveLengthRoute [2] IMPLICIT PointCodeList,
unknownResourceInstance [3] IMPLICIT NULL,
routeInaccessible [4] IMPLICIT PointCode,
processingFailure [5] IMPLICIT NULL,
unknown Initiating SP [6] IMPLICIT PointCode,
timerExpired [7] IMPLICIT PointCodeList]
::=2
}
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T15.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 2P
.LP
8.1.2.1
\fIEvent Information\fR
.sp 1P
.RT
.sp 1P
.LP
8.1.2.1.1
\fIsuccess\fR
.sp 9p
.RT
.PP
On successful completion, the trace of the point codes (one or
more) of the crossed SPs are included.
.RT
.ce
\fBH.T. [T16.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(84p) | lw(36p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(84p) | lw(36p) .
success 10100000
_
.T&
lw(84p) | lw(36p) .
\fIContents\fR \fIReferences\fR
_
.T&
lw(84p) | lw(36p) .
{
Sequence of Point Codes, Tagged as \*QPoint Code\*U, with contents
indicating the exact point code.
} 8.1.1.1.4
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T16.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
8.1.2.1.2\ \ \fIdetectedLoop\fR
.sp 9p
.RT
.PP
When a loop is detected, the point codes (three or more) contained in the
loop are included.
.RT
.ce
\fBH.T. [T17.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(84p) | lw(36p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(84p) | lw(36p) .
detectedLoop 10100001
_
.T&
lw(84p) | lw(36p) .
\fIContents\fR \fIReferences\fR
_
.T&
lw(84p) | lw(36p) .
{
Sequence of Point Codes, Tagged as \*QPoint Code\*U, with contents
indicating the exact point code.
} 8.1.1.1.4
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T17.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
8.1.2.1.3\ \ \fIexcesiveLengthRoute\fR
.sp 9p
.RT
.PP
When an excessively long route is found (threshold exceeded), the entire
route is included.
.RT
.ce
\fBH.T. [T18.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(84p) | lw(36p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(84p) | lw(36p) .
excessiveLengthRoute 10100010
_
.T&
lw(84p) | lw(36p) .
\fIContents\fR \fIReferences\fR
_
.T&
lw(84p) | lw(36p) .
{
Sequence of Point Codes, Tagged as \*QPoint Code\*U, with contents
indicating the exact point code.
} 8.1.1.1.4
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T18.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
8.1.2.1.4\ \ \fIunknownResource\fR
.sp 9p
.RT
.PP
If the resource instance is unknown, no additional information is required.
.RT
.ce
\fBH.T. [T19.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(60p) | lw(36p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(60p) | lw(36p) .
unknownResourceInstance 10000011
_
.T&
lw(60p) | lw(36p) .
\fIContents\fR \fIReferences\fR
_
.T&
lw(60p) | lw(36p) .
empty \(em
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T19.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
8.1.2.1.5\ \ \fIrouteInaccessible\fR
.sp 9p
.RT
.PP
The point code of the node where the route was inaccessible is
included.
.RT
.ce
\fBH.T. [T20.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(114p) | lw(36p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(114p) | lw(36p) .
routeInaccessible 10000100
_
.T&
lw(114p) | lw(36p) .
\fIContents\fR \fIReferences\fR
_
.T&
lw(114p) | lw(36p) .
{
Bit 0 contains the first bit of the Point Code,
} 8.1.1.1.1
.T&
lw(114p) | lw(36p) .
{
Bit 1 contains the second bit of the Point Code, etc.
}
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T20.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
8.1.2.1.6\ \ \fIprocessingFailure\fR
.sp 9p
.RT
.PP
If a processing failure occurs, no additional information is
required.
.RT
.ce
\fBH.T. [T21.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(48p) | lw(36p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(48p) | lw(36p) .
processingFailure 10000101
_
.T&
lw(48p) | lw(36p) .
\fIContents\fR \fIReferences\fR
_
.T&
lw(48p) | lw(36p) .
empty \(em
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T21.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
8.1.2.1.7\ \ \fIunknownInitiating SP\fR
.sp 9p
.RT
.PP
The point code of the node detecting the unknown Initiating SP is included.
.RT
.ce
\fBH.T. [T22.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(114p) | lw(36p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(114p) | lw(36p) .
unknown Initiating SP 10000110
_
.T&
lw(114p) | lw(36p) .
\fIContents\fR \fIReferences\fR
_
.T&
lw(114p) | lw(36p) .
{
Bit 0 contains the first bit of the Point Code,
} 8.1.1.1.1
.T&
lw(114p) | lw(36p) .
{
Bit 1 contains the second bit of the Point Code, etc.
}
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T22.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
8.1.2.1.8\ \ \fItimerExpired\fR
.sp 9p
.RT
.PP
The point code(s) of the node(s) from where no result for the
testRoute Action was received is included.
.RT
.ce
\fBH.T. [T23.795]\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
lw(84p) | lw(36p) .
\fIParameter\fR \fICode\fR
_
.T&
lw(84p) | lw(36p) .
timerExpired 10100111
_
.T&
lw(84p) | lw(36p) .
\fIContents\fR \fIReferences\fR
_
.T&
lw(84p) | lw(36p) .
{
Sequence of one or more Point Codes tagged as \*QPoint Code\*U, with
contents indicating the exact point code.
} \(em
_
.TE
.nr PS 9
.RT
.ad r
\fBTable [T23.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.PP
.sp 4
OMAP runs tests on resources such as the MTP and SCCP routing
tables. These resources are here described as \*QResource Classes\*U and are
identified by an object identifier which specifies the CCITT, the study
period Q.795, and the type of resource. This structure is shown below for
the OMAP
object identifiers mtp\(hyRouting\(hyTables and sccp\(hyRouting\(hyTables.
.LP
omap\ \ \ \ \ OBJECT IDENTIFIER ::= { CCITT, Q.795\ }
mtp\(hyRouting\(hyTables\(hy1988
OBJECT IDENTIFIER ::= { omap 0\ }
sccp\(hyRouting\(hyTables\(hy1988
OBJECT IDENTIFIER ::= { omap 1\ } [unused]
.PP
The Resource Class of MTP Routing Tables is 0011861B00
(hexadecimal), and for SCCP Routing Tables is 0011631B01 (hexadecimal). See
Recommendation\ X.208, Annex\ C.
.LP
.rs
.sp 10P
.ad r
\fBFigure 6/Q.795 Sheet 1 of 8 [T24.795], p. \ \
(\*`a traiter comme tableau
MEP)\fR
.sp 1P
.RT
.ad b
.RT
.LP
.sp 6
.bp
.sp 1P
.LP
\fIOM\(hyEVENT\(hyREPORT\fR
.sp 9p
.RT
.PP
The
OM\(hyEVENT\(hyREPORT
service as given in Table\ 1/Q.795
provides a user with the capability to report the occurrence of an event
concerning a management resource to a user in another open system. The
specific event that occurred is interpreted in the context of the resource
class
specified.
.RT
.ce
\fBH.T. [T25.795]\fR
.ce
TABLE\ 1/Q.795
.ce
\fBOM\(hyEVENT\(hyREPORT Parameters\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
cw(54p) | cw(42p) .
Parameter Name Req/Ind
_
.T&
lw(54p) | cw(42p) .
InvokeID M
.T&
lw(54p) | cw(42p) .
ResourceClass M
.T&
lw(54p) | cw(42p) .
ResourceInstance M
.T&
lw(54p) | cw(42p) .
EventValue M
.T&
lw(54p) | cw(42p) .
EventTime O
.T&
lw(54p) | cw(42p) .
EventInfo O
_
.T&
lw(186p) .
{
\fIParameters Definitions:\fR
}
.T&
lw(186p) .
{
InvokeID:
as defined in Recommendation Q.772.
}
.T&
lw(186p) .
{
ResourceClass:
identifies the class of resources for which this
event is defined.
}
.T&
lw(186p) .
{
ResourceInstance:
identifies the resource instance on which the event
is to be performed.
}
.T&
lw(186p) .
{
EventValue:
specifies the particular event that is being
reported by the resource instance.
}
.T&
lw(186p) .
{
EventTime:
specifies the time at which the event was
generated.
}
.T&
lw(186p) .
{
EventInfo:
provides additional event specific
information.
}
.TE
.nr PS 9
.RT
.ad r
\fBTable 1/Q.795 [T25.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.PP
The eventReport operation is defined, using the TCAP OPERATION
MACRO, as in Figure\ 6/Q.795, Sheet\ 2.
.LP
\-v'6p'
.rs
.sp 13P
.ad r
\fBFigure 6/Q.795 Sheet 2 of 8 [T26.795], p. \ \
(\*`a traiter comme tableau
MEP)\fR
.sp 1P
.RT
.ad b
.RT
.PP
Specific event reports are categorized by resource class. The
protocol uses may be described by the EVENT Macro in Figure\ 6/Q.795, Sheet\ 3.
.LP
\-v'6p'
.rs
.sp 12P
.ad r
\fBFigure 6/Q.795 Sheet 3 of 8 [T27.795], p. \ \
(\*`a traiter comme tableau
MEP)\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
\fIOM\(hyCONFIRMED\(hyACTION\fR
.sp 9p
.RT
.PP
The
OM\(hyCONFIRMED\(hyACTION
service as shown in Table\ 2/Q.795 provides a user with the capability
to request that a management action be
performed on a resource instance by a user in another open system. The
specific action to be performed is interpreted in the context of the resource
class
specified. This service is a confirmed service (a report of success or
failure is always sent).
.RT
.LP
\-v'6p'
.ce
\fBH.T. [T28.795]\fR
.ce
TABLE\ 2/Q.795
.ce
\fBOM\(hyCONFIRMED\(hyACTION Service\fR
.ps 9
.vs 11
.nr VS 11
.nr PS 9
.TS
center box;
cw(48p) | cw(36p) | cw(36p) .
Parameter Name Req/Ind Res/Con
_
.T&
lw(48p) | cw(36p) | cw(36p) .
InvokeID M M=
.T&
lw(48p) | cw(36p) | cw(36p) .
AccessControl O \(em
.T&
lw(48p) | cw(36p) | cw(36p) .
ResourceClass M \(em
.T&
lw(48p) | cw(36p) | cw(36p) .
ResourceInstance M \(em
.T&
lw(48p) | cw(36p) | cw(36p) .
CnfAction Value M \(em
.T&
lw(48p) | cw(36p) | cw(36p) .
ActionArg O \(em
.T&
lw(48p) | cw(36p) | cw(36p) .
ActionResult \(em M | ua\d\u)\d
.T&
lw(48p) | cw(36p) | cw(36p) .
ActionError \(em M | ub\d\u)\d
.TE
.LP
\ua\d\u)\d
Mandatory in Return Result component (may be empty).
.LP
\ub\d\u)\d
Mandatory in Return Error component.
.TS
center box ;
lw(204p) .
{
\fIParameter Definitions:\fR
}
.T&
lw(204p) .
{
InvokeID:
as defined in Recommendation Q.772.
}
.T&
lw(204p) .
{
AccessControl:
information to be used as input to access control
functions.
}
.T&
lw(204p) .
{
ResourceClass:
identifies the class of resources for which this
action is defined.
}
.T&
lw(204p) .
{
ResourceInstance:
identifies the resource instance on which the action
is to be performed.
}
.T&
lw(204p) .
{
ActionValue:
specifies a particular action that is to be
performed on the resource instance.
}
.T&
lw(204p) .
{
ActionArg:
contains the argument for the particular action
being invoked.
}
.T&
lw(204p) .
{
ActionResult:
this field contains the result of the successful
action performed, as appropriate.
}
.T&
lw(204p) .
{
ActionError:
this field indicates error or problem status
information if the action did not successfully
complete.
}
.TE
.nr PS 9
.RT
.ad r
\fBTable 2/Q.795 [T28.795], p.\fR
.sp 1P
.RT
.ad b
.RT
.PP
The confirmedAction operation is defined, using the TCAP
OPERATION MACRO, as shown in Figure 6/Q.795, Sheet 4.
.LP
\-v'6p'
.rs
.sp 18P
.ad r
\fBFigure 6/Q.795 Sheet 4 of 8 [T29.795], p. \ \
(\*`a traiter comme tableau
MEP)\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.PP
Specific Actions are categorized by resource class. The protocol uses may
be described by the ACTION Macro as shown in Figure\ 6/Q.795, Sheet\ 5.
.LP
.rs
.sp 16P
.ad r
\fBFigure 6/Q.795 Sheet 5 of 8 [T30.795], p. \ \
(\*`a traiter comme tableau
MEP)\fR
.sp 1P
.RT
.ad b
.RT
.LP
.sp 3
.sp 1P
.LP
\fIERROR DEFINITIONS\fR
.sp 9p
.RT
.PP
A number of error codes have been referred to in the definition of the
two OM\(hyServices. These error situations are defined in this section.
.RT
.LP
\fIDefinitions:\fR
.LP
noSuchResourceClass:
the resource class in the Invoke APDU is not recognized by the receiving
end.
.LP
noSuchResource:
while the resource class in the Invoke APDU is recognized, there is no
corresponding resource instance of that class at the
receiving end.
.LP
accessDenied:
access to the resource is denied.
.LP
processingFailure:
a failure occurred while processing a
specific action or event. The failure indicators and parameters are action
or event specific.
.LP
noSuchEvent:
the event type specified is not supported by or
known to the receiving end.
.LP
noSuchAction:
the action type specified is not supported by or known to the receiving end.
.LP
noSuchAttribute:
the attribute specified is not supported
by or known to the receiving end.
.LP
invalidAttributeValue:
the attribute value is out of
range.
.LP
.rs
.sp 06P
.ad r
BLANC
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 22P
.ad r
\fBFigure 6/Q.795 (page 6 sur 8) [T31.795], p. \ \ (\*`a traiter comme tableau
MEP)\fR
.sp 1P
.RT
.ad b
.RT
.LP
.sp 2
.rs
.sp 26P
.ad r
\fBFigure 6/Q.795 (page 7 sur 8) [T32.795], p. \ \ (\*`a traiter comme tableau
MEP)\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
\fIOTHER TYPE DEFINITIONS\fR
.sp 9p
.RT
.LP
.rs
.sp 12P
.ad r
\fBFigure 6/Q.795 Sheet 8 of 8 [T33.795], p. \ \
(\*`a traiter comme tableau
MEP)\fR
.sp 1P
.RT
.ad b
.RT
.LP
.sp 10
.ce 1000
ANNEX\ A
.ce 0
.ce 1000
(to the Recommendation Q.795)
.sp 9p
.RT
.ce 0
.ce 1000
\fBExample MRVT message as delivered to the SCCP\fR
.sp 1P
.RT
.ce 0
.LP
.rs
.sp 24P
.ad r
\fBFigure A\(hy1/Q.795, p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure A\(hy2/Q.795, p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure A\(hy3/Q.795 [T34.795], p. \ \
(\*`a traiter comme tableau MEP)\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure A\(hy4/Q.795 [T35.795], p. \ \
(\*`a traiter comme tableau MEP)\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 40P
.ad r
\fBFigure A\(hy5/Q.795 [T36.795], p. \ \
(\*`a traiter comme tableau MEP)\fR
.sp 1P
.RT
.ad b
.RT
.LP
.sp 7
.bp
.ce 1000
ANNEX\ B
.ce 0
.ce 1000
(to Recommendation Q.795)
.sp 9p
.RT
.ce 0
.ce 1000
\fBSCCP Routing Verification Test (SRVT)\fR
.sp 1P
.RT
.ce 0
.LP
B.1
\fIIntroduction\fR
.sp 1P
.RT
.PP
This annex describes an SCCP Routing Verification Test (SRVT). The procedure
described covers the case of a single MTP network. Enhancements of
this procedure are required to ensure that:
.RT
.LP
\(em
the procedure works for multiple MTP networks;
.LP
\(em
the procedure tests the change of Gobal Title at an SCCP
relay node;
.LP
\(em
the procedure is signalling network structure
independent.
.sp 2P
.LP
B.2
\fISRVT\fR
.sp 1P
.RT
.sp 1P
.LP
B.2.1
\fIGeneral\fR
.sp 9p
.RT
.PP
The SCCP Routing Verification Test (SRVT) is the means of testing the global
title translation service of the Signalling Connection Control Part (SCCP).
The test is designed to verify the accuracy and completeness of the
global title translation data in global title translation service points.
This test is only meant for the case of a single MTP network. An SRVT for
multiple MTP networks is for further study. The test will be used after
a recent
translation data change, when a translation problem is suspected, or on a
periodic basis to detect cases of mutilation of translation data.
.PP
When an inconsistency or failure is detected, local actions are to be specified.
The initiator of the test is alerted.
.RT
.sp 1P
.LP
B.2.2
\fIMessages\fR
.sp 9p
.RT
.PP
The SCCP Routing Verification Test uses three OMAP messages which are specified
by the OMAP Application Service Element.
.RT
.sp 1P
.LP
B.2.2.1
\fISCCP Routing Verification Test (SRVT) message\fR
.sp 9p
.RT
.PP
The SRVT message is sent from a Signalling Point (SP) initiating
the appropriate part of the SRVT procedure based on the function of the
respective\ SP. The message serves three different functions, depending
upon the nature of the SP sending it. In coding, both Verify and Request
are delineated by the No Compare setting of the From Indicator parameter.
.PP
The request form of the SRVT message is sent by a Signalling Point
(SP) to request an SRVT global title translation within the SRVT procedure.
The originating SP may be the Near End Signalling Point (NESP), or an Intermediate
Translation Signalling Point (ITSP). The destination of the message is
a
Translation Signalling Point (TSP) which is to perform a global title
translation on the Global Title contained in the message. Hence, the
Translation Point Code (TPC) is the Destination Point Code (DPC) in the
routing label.
.PP
The Verify form of the SRVT message is sent by a Final Translation
Signalling Point (FTSP), i.e.\ the last SP that performs the global title
translation service, to both the Primary Point Code (PPC) and the Secondary
.PP
Point Code (SCP, if any) derived from the global title translation. Hence,
the PPC and SPC are used as the Destination Point Codes (DPC) in the routing
labels.
.PP
The Compare form of the SRVT message is sent by a Translation
Signalling Point (TSP) to a point performing the duplex global title
translation. The message is sent so the results of both tanslations can be
compared. This message is mandatory only in networks that have duplex global
title translation service (i.e. the identical translation is duplicated at a
mate signalling point). The point code of the Duplex Translation Signalling
Point (DTSP) is the Destination Point Code (DPC) in the routing label.
.bp
.PP
The message contains:
.RT
.LP
a)
Information Indicating SRVT;
.LP
b)
Form Indicator (Compare or No Compare);
.LP
c)
GTI + GT \(em Global Title Indicator + Global Title
(Destination);
.LP
d)
MTP Backward Routing Required Indicator for SRVA and SRVR;
.LP
e)
NEPC \(em Near End Point Code from which test was initiated;
.LP
f
)
GTI + NEGT \(em Global Title Indicator + Near End Global
Title;
.LP
g)
DPC \(em Destination Point Code (Translation PC or
Primary\ PC);
.LP
h)
Destination SSN \(em Optional Subsystem Number based on DPC;
.LP
i)
Backup DPC \(em Backup Destination Point Code (Translation PC
or Secondary\ PC);
.LP
j
)
Backup SSN \(em Optional Subsystem Number based on
Backup\ DPC;
.LP
k)
Threshold N of maximum allowed number of crossed translation
points;
.LP
l)
Additional Trace Information Requested Indicator (SRVR
Requested);
.LP
m)
List of Translation Points \(em used to check for translation
loops and whether or not the threshold number of translations is
exceeded.
.sp 1P
.LP
B.2.2.2
\fISCCP Routing Verification Acknowledgement (SRVA)\fR
\fIMessage\fR
.sp 9p
.RT
.PP
The SRVA message is the standard message sent in response to an
associated SRVT message. It carries the results of the test and is sent back
using either direct routing on the Originating Point Code (OPC) or by global
title translation on the Near End Global Title. Both addresses are found
from the original message to which the SRVA is responding. The Destination
Point
Code (DPC) in the routing label may be dependent upon a global title
translation if the MTP Backward Routing Indicator in the SRVT message is not
set.
.PP
The message contains:
.RT
.LP
a)
Information Indicating SRVA;
.LP
b)
SRVR sent indicator;
.LP
c)
Result of test.
.LP
This last field contains the following information:
.LP
\(em
Success (no error indication);
.LP
\(em
Partial Success (at least one SRVA indicating success
or partial success); or
.LP
\(em
Failure.
.LP
In the case of partial success or failure, some or all of
the following failure reasons are provided:
.LP
i)
No translation data exists for the GTI + GT at
Translation Signalling Point.
.LP
ii)
Incorrect translation for PPC + SSN at Translation Signalling Point.
.LP
iii)
Incorrect translation for SPC + SSN at Translation Signalling Point.
.LP
iv)
Incorrect intermediate translation for next
translation point at Translation Signalling Point.
.LP
v)
SRVT message arrived at wrong Signalling Point (Not duplicate or mated).
.LP
vi)
The primary destination of the GT address does not serve GTI\ +\ GT as
the primary destination.
.LP
vii)
The secondary destination of the GT address does
not serve GTI\ +\ GT as the secondary destination.
.LP
viii)
The primary destination of the GT address does not recognize the SPC\
+\ SSN as the secondary destination for the GTI\ +\ GT.
.LP
ix)
The secondary destination of the GT address does not recognize the PPC\
+\ SSN as the primary destination for the GTI\ +\ GT.
.LP
x)
Timeout waiting for SRVA message.
.LP
xi)
Inability to send message due to inaccessibility
(network congestion or blockage).
.LP
xii)
Detected loop at signalling point.
.LP
xiii)
Exceeded threshold of N translations at signalling point.
.LP
xiv)
Routing problem \(em Run MRVT.
.LP
xv)
Unknown Initiator \(em NEGT (reverse routing to be done using\ OPC).
.LP
xvi)
Test cannot be run due to local conditions.
.bp
.sp 1P
.LP
B.2.2.3
\fISCCP Routing Verification result (SRVR) message\fR
.sp 9p
.RT
.PP
The SRVR message is sent from a terminating SP to the initiator of the
test when \*QAdditional Trace Information Requested\*U indicator is set.
It
carries the results of the test with additional information on a failure.
It is sent back using either direct routing on the Near End Point Code
(NEPC) or by global title translation on the Near End Global Title (NEGT).
.PP
The message contains:
.RT
.LP
a)
Information Indicating SRVR;
.LP
b)
Result of test;
.LP
c)
Information field.
.LP
The content of this information field depends on the result
of the test. It contains:
.LP
i)
If the result of the test is \*Qsuccess\*U:
.LP
\(em
the point codes of the crossed SCCP Relay Nodes
contained in the SRVT message.
.LP
ii)
If the result of the test is \*Qdetected loop\*U:
.LP
\(em
the point codes of the SCCP Relay Nodes which
are in the loop.
.LP
iii)
If the result of the test is \*Qdetected excessive
length route\*U:
.LP
\(em
the point codes of crossed SCCP Relay Nodes
contained in the SRVT message.
.LP
iv)
If the result of the test is \*Qunknown destination
point code\*U:
.LP
\(em
no additional information.
.LP
v)
If the result of the test is \*QSRVT not sent due to
inaccessibility\*U:
.LP
\(em
the point code of the inaccessible SP.
.LP
vi)
If the result of the test is \*QSRVA not received\*U:
.LP
\(em
the identity of the SP(s) from which an SRVA
was not received when expected.
.LP
vii)
If the result of the test is \*Qunknown initiator
point code\*U:
.LP
\(em
the point code of the SP returning an SRVA to
cause the MRVR to be sent.
.LP
viii)
If the result of the test is \*Qtest cannot be run
due to local conditions\*U:
.LP
\(em
no additional information.
.LP
ix)
If any other failure result:
.LP
\(em
the point codes of the crossed SCCP Relay
Nodes contained in the SRVT message.
.sp 1P
.LP
B.2.3
\fITest initiation\fR
.sp 9p
.RT
.PP
The procedure is started when there is an input from OA&M (SMAP)
resulting in the sending of an SRVT message. The test is initiated:
.RT
.LP
a)
When new SCCP routing data is introduced. Each global title
translation should pass the SRVT before being opened to
traffic.
.LP
b)
When SCCP translation data is changed.
.LP
c)
On receipt of an SRVT message.
.LP
d)
On demand from local maintenance staff or an operations and
maintenance centre.
.LP
e)
Periodically at a Signalling Point to detect cases of
mutilation of translation data. The period is network dependent
and should be such that the load on the network is not seriously
increased.
.sp 1P
.LP
B.2.4
\fIProcedures\fR
.sp 9p
.RT
.PP
The capability to execute a complete SCCP Routing Verification Test (SRVT)
is found in three procedures. These procedures are organized by the
function of the Signalling Point in which they reside for a given test
instance. The procedures are partitioned into functions at the initiating
point, functions at a translation point, and functions at the tested
destination. The duplex translation procedures are found in the translation
points.
.RT
.sp 1P
.LP
B.2.4.1\ \ \fIInitiating point\fR
.sp 9p
.RT
.PP
The procedure is started when there is an input from OA&M as
defined under the conditions of \(sc\ B.2.3. It is initiated at an SP with SCCP
capabilities in the network, and is triggered by an SRVT request. The SRVT
request must include the Global Title of the tested destination. An SCCP
Node cannot initiate an SRVT procedure for a test destination until any
previous
SRVT procedures for that destination have completed.
.bp
.RT
.sp 1P
.LP
B.2.4.1.1\ \ \fIInitial actions\fR
.sp 9p
.RT
.PP
Upon receipt of an SRVT request on a given Global Title, the Near End Signalling
Point (NESP) determines the location(s) of the initial
translation from its tables. The NESP then begins a guard timing period, T2,
and sends SRVT messages to the Translation Point Codes (TPCs) previously
determined. The NESP then waits for SRVA messages corresponding to each SRVT
sent.
.PP
If the NESP was identified as a Translation Signalling Point (TSP) for
the respective Global Title, it performs the Global Title Translation,
and
follows the procedures defined at a translation point (\(sc\ B.2.4.2),
depending
upon the nature of the translation (i.e.\ intermediate or final).
.RT
.sp 1P
.LP
B.2.4.1.2\ \ \fISubsequent actions\fR
.sp 9p
.RT
.PP
Upon receipt of all SRVA messages, the guard timer, T2, is stopped and
the test is complete. The results are reported to system management (SMAP)
in accordance to the structure of the Result of Test parameters (\(sc\
B.2.2.2) and proper actions are taken to fix any problems. If the timer
expires before
receipt of an SRVA message, the result, Time out waiting for SRVA message
(\(sc\ B.2.2.2.\ c.x), is reported to management (SMAP) along with the
Point Code
of the\ SP. There is no penalty for not receiving an SRVR. However, it is
assumed, analogous to the MRVTs MRVR message, that the SRVR will return
before the final\ SRVA.
.RT
.sp 1P
.LP
B.2.4.2\ \ \fITranslation point\fR
.sp 9p
.RT
.PP
For the SRVT, two types of Translation Points exist: intermediate and final.
The procedure at the Translation point differs only in the content of the
SRVT messages which emerge. An intermediate translation point is an SP
with SCCP functionality that has been specified at the NESP for the translation
of the Global Title originally given. However, due to the nature of the
Global Title, further translation at another SP is needed to determine
the PC of the tested destination.
.PP
A final translation point is an SP with SCCP functionality that has
been specified at the NESP or an ITSP for the translation of the Global
Title. It performs the final translation which results in a Primary Point
Code +
Subsystem Number (PPC\ +\ SSN) and a Secondary Point Code\ +\ Subsystem Number
(SPC\ +\ SSN) (optional). Note that the NESP does not know if it sends
an SRVT message to an Intermediate or Final Translation Signalling Point.
.RT
.sp 1P
.LP
B.2.4.2.1\ \ \fIUpon Receipt of an SRVT message\fR
.sp 9p
.RT
.PP
When a Translation Signalling Point (TSP) receives an SRVT message, it:
.RT
.LP
a)
Attempts to translate the GTI + GT to the PPC + SSN and
SPC\ +\ SSN (optional):
.LP
i)
If the SP is unable to perform the translation, the
Result of Test is equal to \*QNo translation data exists\*U. The SP sends
an SRVR to the NESP, an SRVA message with SRVR sent indication and corresponding
result parameter (\(sc\ B.2.2.2\ c.i) to the OPC, and an indication to\
SMAP.
.LP
ii)
If it recognizes that further translation is needed, a Translation Point
Code (TPC) and a backup Translation Point Code (optional) are derived.
.LP
iii)
If the translation is final and successful, the
PPC\ +\ SSN and SPC\ +\ SSN (optional) are derived and retained for the SRVA
message.
.LP
b)
Checks for mated SCCP relay node:
.LP
i)
If a mated SCCP relay node exists for the current TSP, a SRVT is sent
to the mate so that it may perform duplicate translation for
comparison purposes.
.LP
ii)
If no mated SCCP Relay Node exists, the test proceeds with step\ c) below.
.LP
c)
Examines the list of translation points (\(sc\ B.2.2.1\ m):
.LP
i)
If the point code of the next TSP or the point code of the mated SCCP
Relay Node (optional) appears in the SRVT's list of translation points,
then the SP sends an SRVR to the NESP, an SRVA message with SRVR sent indication
and an SCCP loop detected indication (\(sc\ B.2.2.2\ c.xii) to the OPC,
and an indication to SMAP. The test is stopped.
.LP
ii)
If the number of point codes in the SRVT's list of
translation points exceeds a predefined threshold number of translations,
then the SP sends an SRVR to the NESP, the SP an SRVA message with SRVR
sent
indication and the threshold exceeded indication (\(sc\ B.2.2.2\ c.xiii)
to the OPC, and an indication to SMAP. The test is stopped.
.bp
.LP
iii)
If any point code(s) of the next TSP or the mated
SCCP Relay Node (Optional) does not appear in the SRVT's list of translation
points, then the TSP will add both its own point code and the point code
of the mated SCCP Relay Node (if any) to the list of translation points.
.LP
d)
Attempts to send an SRVT message to the next TPC or tested destination
(from\ a) above):
.LP
i)
If the TSP is unable to send the SRVT due to
inaccessability (network congestion or blockage), the TSP sends an SRVR
to the NESP, an SRVA with SRVR sent indication and corresponding result
parameter
(\(sc\ B.2.2.2\ c.xi) to the OPC and an indication to SMAP. The test is
stopped.
.LP
ii)
If the TSP is unable to send the SRVT due to an MTP routing problem,
the TSP sends an SRVR to the NESP, an SRVA with SRVR sent
indication and the corresponding result parameter (\(sc\ B.2.2.2\ c.xiv)
to the OPC and an indication to SMAP. The test is stopped.
.LP
iii)
If the TSP is unable to send the SRVT due to local conditions, the TSP
sends an SRVR to the NESP, an SRVA with SRVR sent
indication and the corresponding result parameter (\(sc\ B.2.2.2\ c.xvi)
to the OCP and an indication to SMAP. The test is stopped.
.LP
iv)
If an SRVT may be sent, a guard timer, T2, is started and SRVT message(s)
are sent to either the next TPC(s) or the PPC\ \(em\ SSN and
SPC\ +\ SSN (optional) resulting from attempted translation. This timer is the
guard for SRVA(s) received in response to both the Compare and No Compare
SRVT messages.
.sp 1P
.LP
B.2.4.2.2\ \ \fISubsequent actions\fR
.sp 9p
.RT
.PP
Upon receipt of an SRVA message, the following actions are
taken:
.RT
.LP
a)
If all of the SRVA(s) in response to the SRVT(s) have not
yet been received, the results are stored, waiting for pending SRVA(s).
.LP
b)
If all other expected SRVA(s) have been received, the
following actions are taken:
.LP
i)
The guard timer, T2, is stopped.
.LP
ii)
The reverse Global Title Translation is performed on the NEGT to determine
the Originating Point Code (OPC). This may be
considered optional in networks which perform reverse routing on OPC (known
from e.g.\ Network Identifier) instead of Global Title Translation. If
the NEGT is not recognized, an SRVA is retured to the previous PC with
the \*QUnknown
Initiator\*U indication (\(sc\ B.2.2.2\ c.xv).
.LP
iii)
Results of the duplicate translation comparison are incorporated into
the Result of Test parameters\ (\(sc\ B.2.2.2). This is optional in
networks not subscribing to the concept of mated SCCP Relay Nodes and duplicate
translations. If the SRVA in response to the SRVT has not yet been received,
the ITSP will wait for it up to the expiration of the timer.
.LP
iv)
If the SRVR send indication is not set and an SRVR
has been requested, the SP sends an SRVR message with appropriate indications
from the\ SRVA.
.LP
v)
The SP sends an SRVA message in response to the
original SRVT message. The complete result of test parameter list is retained
and the SRVR sent indication is set appropriately.
.LP
c)
If the timer has already expired, the message is
discarded.
.PP
If the guard timer expires before receipt of the SRVA(s)
responding to the SRVT(s), results of the duplicate translation comparison
are incorporated into the Result of Test parameters (if available) and
an SRVA is sent back with the \*QTimeout waiting for SRVA message\*U response
(\(sc\ B.2.2.2\ c.x). Any
SRVAs received after the timer expires will be discarded. If an SRVA cannot
be sent, no further action is taken.
.sp 1P
.LP
B.2.4.2.3\ \ \fIDuplex translation (optional)\fR
.sp 9p
.RT
.PP
When a TSP receives an SRVT message, it:
.RT
.LP
a)
Checks to determine if the originating SP is a mated SCCP
Relay Node to the receiving\ SP. If not, an SRVA is returned with \*QSRVT
arrived at wrong\ SP\*U (\(sc\ B.2.2.2\ c.v).
.bp
.LP
b)
Attempts to translate GTI + GT and compares the results with the point
code information contained in the SRVT message:
.LP
i)
If the results of the duplicate translation match the data in the SRVT
message from the previous translation, an SRVA message is
returned with Result of Test equal to success\ (\(sc\ B.2.2.2\ c).
.LP
ii)
If no translation data exists for the Global Title, then an SRVA message
is returned with the result \*QNo translation data exists
for the GTI\ +\ GT\*U (\(sc\ B.2.2.2\ c.i).
.LP
iii)
If the results of the duplicate translation do not match the data in
the SRVT message from the previous translation, an SRVA
message is returned with Result of Test equal to either \*QIncorrect intermediate
translation\*U (\(sc\ B.2.2.2\ c.iv), \*QIncorrect translation for PPC\
+\ SSN\*U
(\(sc\ B.2.2.2\ c.ii) or \*QIncorrect translation for SPC\ +\ SSN\*U
(\(sc\ B.2.2.2\ c.iii).
.sp 1P
.LP
B.2.4.3\ \ \fITested destination\fR
.sp 9p
.RT
.PP
The tested destination is an SP with SCCP functionality that has
been specified at the FTSP by use of Global Title Translation. The address
is referred to as either the Primary Point Code (PPC) or Secondary Point
Code\ (SPC).
.RT
.sp 1P
.LP
B.2.4.3.1\ \
\fIPrimary point\fR
.sp 9p
.RT
.PP
This procedure is performed at the primary destination signalling point
derived from the global title translation. When the destination receives
an SRVT message, it verifies the PPC\ +\ SSN serves as the primary destination
for the GTI\ +\ GT. The following action should result:
.RT
.LP
a)
If the test is successful, the SP sends an SRVR (if
requested) with success indication to the NESP, an SRVA with SRVR sent
indication and success indication to the OPC, and an indication to\ SMAP.
.LP
b)
If the Signalling Point does not serve GTI + GT as the
primary destination, the test is unsuccessful and the SP sends an SRVR
to the NEPC, an SRVA with the SRVR sent indication set appropriately and
the
corresponding Result of Test parameter (\(sc\ B.2.2.2\ c.vi) to the OPC, and an
indication to\ SMAP.
.LP
c)
If the Signalling Point does not recognize SPC + SSN as the secondary
destination for GTI\ +\ GT, then the test is unsuccessful and the SP
sends an SRVR to the NEPC, an SRVA with the SRVR sent indication set
appropriately and the corresponding Result of Test parameter (\(sc\ B.2.2.2\
c.viii) to the OPC, and an indication to\ SMAP.
.PP
If an SRVA cannot be sent, no further action is taken.
.sp 1P
.LP
B.2.4.3.2\ \
\fISecondary point\fR
.sp 9p
.RT
.PP
This procedure is performed at the secondary destination signalling point
(optional) derived from the global title translation. When the
destination receives an SRVT message, it verifies the SPC\ +\ SSN serves
as the secondary destination for the GTI\ +\ GT. The following action should
result:
.RT
.LP
a)
If the test is successful, the SP sends an SRVR (if
requested) with success indication to the NESP, an SRVA with SRVR sent
indication and success indication to the OPC, and an indication to\ SMAP.
.LP
b)
If the Signalling Point does not serve GTI + GT as the
secondary destination, the test is unsuccessful and the SP sends an SRVR
to the NESP, an SRVA with the SRVR sent indication set appropriately and
the
corresponding Result of Test parameter (\(sc\ B.2.2.2\ c.vii) to the OPC,
and an
indication to\ SMAP.
.LP
c)
If the Signalling Point does not recognize SPC + SSN as the primary destination
for GTI\ +\ GT, then the test is unsuccessful and the SP
sends an SRVR to the NESP, an SRVA with the SRVR sent indication set
appropriately and the corresponding Result of Test parameter (\(sc\ B.2.2.2\
c.ix) to the OPC, and an indication to\ SMAP.
.PP
If an SRVA cannot be sent, no further action is taken.
.sp 1P
.LP
B.3
\fIState transition diagram\fR
.sp 9p
.RT
.PP
Figure B\(hy1/Q.795 shows the state transition diagram for the SRVT
using\ SDL.
.bp
.RT
.LP
.rs
.sp 47P
.ad r
\fBFigure B\(hy1/Q.795 (sheet 1 of 4), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure B\(hy1/Q.795 (sheet 2 of 4), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure B\(hy1/Q.795 (sheet 3 of 4), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure B\(hy1/Q.795 (sheet 4 of 4), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
B.4
\fIExample\fR
.sp 9p
.RT
.PP
Figure B\(hy2/Q.795 demonstrates the SRVT. It should be noted that the
Signalling Points shown are assumed to be SCCP adjacent and NOT physically
adjacent. Furthermore, all examples show both a primary and secondary
destination. The secondary result may be considered optional.
.RT
.LP
.rs
.sp 49P
.ad r
\fBFigure B\(hy2/Q.795, p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 10P
.LP
\fBMONTAGE: \ \ PAGE 542 = BLANCHE\fR
.sp 1P
.RT
.LP
.bp